Type II theorem and hyperdecidability of pseudovarieties of groups
نویسنده
چکیده
The problem of computing the kernel of a finite monoid, popularized under the name “Rhodes type II conjecture”, led Ash to the proof of a strong property (the hyperdecidability) of the pseudovariety G of all finite groups. This paper is a survey of recent results on the study of some related properties of pseudovarieties of groups.
منابع مشابه
Tameness of The Pseudovariety Ls1
A class of finite semigroups V is said to be decidable if the membership problem for V has a solution, that is, if we can construct an algorithm to test whether a given semigroup lies in V. Decidability of pseudovarieties is not preserved by some of the most common pseudovariety operators, such as semidirect product, Mal’cev product and join [1, 17]. In particular Rhodes [17] has exhibited a de...
متن کاملSyntactic and Global Semigroup Theory, a Synthesis Approach
This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of semigroups. We introduce various abstract and algorithmic properties that a pseudovariety of semi-groups might possibly satisfy. The main theorem states that given a nite collection of pseudovarieties, each s...
متن کاملThe Geometry of Profinite Graphs with Applications to Free Groups and Finite Monoids
We initiate the study of the class of profinite graphs Γ defined by the following geometric property: for any two vertices v and w of Γ, there is a (unique) smallest connected profinite subgraph of Γ containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if ...
متن کاملFree Profinite Semigroups Over Some Classes of Semigroups Locally in D(G)
The theory of free profinite semigroups, which received its major impetus with the publication of Reiterman’s paper [17] in the early eighties, has proven to be an important tool in the study of pseudovarieties of semigroups and on the varieties of recognizable languages associated with them (via Eilenberg’s Theorem on varieties [13]). The importance of Reiterman’s theorem was immediately under...
متن کاملAn Eilenberg Theorem for Arbitrary Languages
In algebraic language theory one investigates formal languages by relating them to finite algebras. The most important result along these lines is Eilenberg’s celebrated variety theorem [7]: varieties of languages (classes of regular finite-word languages closed under boolean operations, derivatives and preimages of monoid morphisms) correspond bijectively to pseudovarieties of monoids (classes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013